Pseudo-random number generation for sketch-based estimations
نویسندگان
چکیده
منابع مشابه
Finite Fields and Pseudo-Random Number Generation
The purpose of this set of notes is to show, as simply as possible, how the theory of finite fields applies to certain commonly used pseudo-random number generators. Only those parts of the theory of finite fields that are needed for this purpose are presented, and the development of the algebraic theory needed for this is greatly simplified for this purpose. I have tried to compose these notes...
متن کاملParallel Computation of Optimal Parameters for Pseudo Random Number Generation
Two systematic search methods are employed to nd mul-tipliers for linear congruential pseudo-random number generation which are optimal with respect to the discrepancy of pairs of successive pseudo-random numbers. These two methods are compared in terms of their suitability for parallel computation. Experimental results of a MIMD workstationcluster{implementation and an evaluation of the calcul...
متن کاملSponge-Based Pseudo-Random Number Generators
This paper proposes a new construction for the generation of pseudo-random numbers. The construction is based on sponge functions and is suitable for embedded security devices as it requires few resources. We propose a model for such generators and explain how to define one on top of a sponge function. The construction is a novel way to use a sponge function, and inputs and outputs blocks in a ...
متن کاملPseudo-Random Number Generators
The first option here is not easy. Some pieces of data of this kind exist, for example from the decay of radioactive elements, but generally generation is slow and you cannot get the quantity of random numbers you require for modern applications. The second option here is what I’ll talk about today. Algorithms of this type are called “PseudoRandom Number Generators” (PRNGs). Many bad algorithms...
متن کاملPUF-Based Random Number Generation
From security to randomized algorithms, there are many existing problems whose solutions are fundamentally based on the assumption that intrinsically pure random number sources exist. Pseudorandom number generators can imitate randomness sufficiently well for most applications, however, they still rely on some secret seed input. Hardware random number generators attempt to extract randomness di...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Database Systems
سال: 2007
ISSN: 0362-5915,1557-4644
DOI: 10.1145/1242524.1242528